Proof-relevant pi-calculus

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof-relevant pi-calculus

We present a formalisation in Agda of the theory of concurrent transitions, residuation, and causal equivalence of traces for the π-calculus. Our formalisation employs de Bruijn indices and dependently-typed syntax, and aligns the “proved transitions” proposed by Boudol and Castellani in the context of CCS with the proof terms naturally present in Agda’s representation of the labelled transitio...

متن کامل

Proof-relevant π-calculus

Formalising the π-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and structural congruence. Formalisations have been undertaken in a variety of systems, primarily focusing on well-studied (and challenging) properties such as the theory...

متن کامل

Proof System for Applied Pi Calculus

A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it ...

متن کامل

Pi-nets: interaction nets for pi-calculus

π-calculus is a framework that aims to describe concurrent calculations through a formal definition of processes. Originally, π-calculus is defined by a formal language and a set of reduction rules, much in the spirit of λ-calculus. Our aim is to provide a graphical representation of π-calculus using multi-wired interaction nets, in the spirit this time of proof-nets of linear logic. 1 π-calcul...

متن کامل

Stateful Applied Pi Calculus

We extend the applied pi calculus with state cells, which are used toreason about protocols that store persistent information. Examples are protocolsinvolving databases or hardware modules with internal state. We distinguish be-tween private state cells, which are not available to the attacker, and public statecells, which arise when a private state cell is compromised by the at...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2015

ISSN: 2075-2180

DOI: 10.4204/eptcs.185.4